Finding the longest isometric cycle in a graph
نویسندگان
چکیده
منابع مشابه
Finding the longest isometric cycle in a graph
When searching for the longest cycle in a graph, we sometimes want to restrict our search space to the cycles that do not have crossing edges induced cycles. If we think of the crossing edges as shortcuts, looking for induced cycles is then looking for shortcut-free cycles. However, an induced cycle may have a shortcut in the following sense: For two vertices on the cycle, the distance between ...
متن کاملFinding a Longest Increasing Subsequence from the Paths in a Complete Bipartite Graph∗
Let S = s1, s2, . . . , sn be an integer sequence. The longest increasing subsequence problem is to find an increasing subsequence of S with the longest length. By regarding S as a weight sequence of the vertices in a path, we can redefine the longest increasing subsequence problem on graphs as follows. Let G = (V,E) be a graph in which every vertex v ∈ V has a weight w(v). A longest increasing...
متن کاملFinding Longest Arithmetic Progressions
We describe eÆcient output-sensitive algorithms to nd the longest arithmetic progression in a given set of numbers.
متن کاملAn Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph
We improve Luczak’s upper bounds on the length of the longest cycle in the random graph G(n,M) in the “supercritical phase” where M = n/2 + s and s = o(n) but n2/3 = o(s). The new upper bound is (6.958 + o(1))s2/n with probability 1 − o(1) as n → ∞. Letting c = 1+2s/n, the equivalence between G(n, p) and G(n,M) implies the same result for G(n, p) where p = c/n, c → 1, c − 1 = ω(n−1/3).
متن کاملIntersection of Longest Paths in a Graph
In 1966, Gallai asked whether every connected graph has a vertex that is common to all its longest paths. The answer to this question is negative. We prove that the answer is positive for outerplanar graphs. Another related question was raised in 1995 at the British Combinatorial Conference: Do any three longest paths in a connected graph have a vertex in common? We prove that, in a connected g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.08.008